A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons
نویسنده
چکیده
منابع مشابه
polygons. J. Algorithms, 6(2):213–224, 1985.
[2] B. Bhattacharya and R. Benkoczi. On computing the optimal bridge between two convex polygons. [7] H. Edelsbrunner. Computing the extreme distances between two convex polygons. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons.
متن کاملThe Hausdorff Core Problem on Simple Polygons
We present a study of the Hausdorff Core problem on simple polygons. A polygon Q is a k-bounded Hausdorff Core of a polygon P if P contains Q, Q is convex, and the Hausdorff distance between P and Q is at most k. A Hausdorff Core of P is a k-bounded Hausdorff Core of P with the minimum possible value of k, which we denote kmin. Given any k and any ε > 0, we describe an algorithm for computing a...
متن کاملSolving Geometric Problems with the Rotating Calipers *
Shamos [1] recently showed that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several sets of calipers can be used simultaneously on one convex polygon, or one set of calipers can be us...
متن کامل5. Open Problems 6. References 4. Case 2: P and Q Are Arbitrary Crossing Polygons
Finding the minimum vertex distance between two dis-joint convex polygons in linear time. [6] Supowit, K. J.: The relative neighborhood graph, with an application to minimum spanning trees. A note on the all-nearest-neighbor problem for convex polygons. [10] O'Rourke, J., et al.: A new linear algorithm for intersecting convex polygons.Since P nw and Q R are two linearly separable convex polygon...
متن کامل4. Concluding Remarks
A new linear algorithm for intersecting convex polygons. Comput. An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons. Computing 32:357-364 13. Toussaint GT, Avis D (1982) On a convex hull algorithm for polygons and its application to triangulation problems. A new O(n log n) algorithm for computing the intersection of convex polygons. Pattern Recog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 17 شماره
صفحات -
تاریخ انتشار 1983